Regular Expressions, au point

Caterpillars, context, tree automata and tree pattern matching

We present a novel, yet simple, technique for the speciication of context in struc-tured documents that we call caterpillar expressions. Although we are primarily applying this technique in the speciication of context-dependent style sheets for HTML, SGML and XML documents, it can also be used for query speciication for structured documents, as we shall demonstrate, and for the speciication of ...

Mise au point d'une reaction d'hemagglutination proteinique pour la peste

A Decision Procedure for Regular Expression Equivalence in Type Theory

The use of regular expressions is common in programming languages to extract data from strings, like the scanf function of the C-language for example. As shown in recent works [4,11] the equational theory of regular expressions can also be important for interactive theorem provers as providing a convenient tool for reasoning about binary relations. The fundamental result which is used there is ...

Regular Expressions for Provenance

As noted by Green et al. several provenance analyses can be considered a special case of the general problem of computing formal polynomials resp. power-series as solutions of an algebraic system. Specific provenance is then obtained by means of evaluating the formal polynomial under a suitable homomorphism. Recently, we presented the idea of approximating the least solution of such algebraic s...

Analysis and Synthesis of Facial Expressions by Feature-Points Tracking and Deformable Model

Face expression recognition is useful for designing new interactive devices offering the possibility of new ways for human to interact with computer systems. In this paper we develop a facial expressions analysis and synthesis system. The analysis part of the system is based on the facial features extracted from facial feature points (FFP) in frontal image sequences. Selected facial feature poi...